Novel binary addition tree algorithm (BAT) for calculating the direct lower-bound of the highly reliable binary-state network reliability

Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation communication social and computer grid systems are typically modeled network structures. Network reliability represents success probability a it is an effective popular metric for evaluating performance all types networks. Binary-state networks composed binary-state (e.g., working or failed) components (arcs and/or nodes) some most The scale has grown dramatically in recent years. For example, have more than billion users. Additionally, increased result both mature emergent technology. highly reliable practical to calculate approximated reliability, rather exact which NP-hard problem. Therefore, we propose novel direct lower bound based on binary addition tree algorithm called AppBAT approximate reliability. efficiency effectiveness proposed analyzed time complexity validated through numerical experiments.